Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding - Information Theory, IEEE Transactions on

نویسندگان

  • Sergio Benedetto
  • Dariush Divsalar
  • Guido Montorsi
چکیده

A serially concatenated code with interleaver consists of the cascade of an outer encoder, an interleaver permuting the outer codewords bits, and an inner encoder whose input words are the permuted outer codewords. The construction can be generalized to h cascaded encoders separated by h 1 interleavers. We obtain upper bounds to the average maximumlikelihood bit error probability of serially concatenated block and convolutional coding schemes. Then, we derive design guidelines for the outer and inner encoders that maximize the interleaver gain and the asymptotic slope of the error probability curves. Finally, we propose a new, low-complexity iterative decoding algorithm. Throughout the paper, extensive comparisons with parallel concatenated convolutional codes known as “turbo codes” are performed, showing that the new scheme can offer superior performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding

A serially concatenated code with an interleaver consists of the cascade of an outer code, an interleaver permuting the outer codewords’ bits, and an inner code whose input words are the permuted outer codewords. The construction can be generalized to h cascaded codes separated by h − 1 interleavers. We obtain upper bounds to the average maximum-likelihood bit-error probability of serially conc...

متن کامل

A serial concatenation approach to iterative demodulation and decoding

Iterative demodulation and decoding of convolutionally encoded data is treated as a special case of the recently proposed serial concatenation of interleaved codes. It is shown that by exploiting the recursive nature of the differential modulation schemes (for example, DBPSK, DQPSK, CPM, etc.), large interleaving gains can be achieved similar to serial concatenation schemes. We also show that w...

متن کامل

Performance of Hybrid Concatenated Trellis Codes CPFSK with Iterative Decoding over Fading Channels

Concatenation is a method of building long codes out of shorter ones, it attempts to meet the problem of decoding complexity by breaking the required computation into manageable segments. Concatenated Continuous Phase Frequency Shift Keying (CPFSK) facilitates powerful error correction. CPFSK also has the advantage of being bandwidth efficient and compatible with non-linear amplifiers. Bandwidt...

متن کامل

Designing Iterative Decoding Schemes with the Extrinsic Information Transfer Chart

Since the discovery of parallel concatenated (turbo) codes, iterative decoding has become a vital field of research in digital communications. Applications of the “turbo principle” to many detection and decoding problems have been found. While most studies have focused on designing code concatenations with respect to maximum likelihood decoding performance, the convergence properties of iterati...

متن کامل

Near optimum error correcting coding and decoding: turbo-codes

AbsfructThis paper presents a new family of convolutional codes, nicknamed turbo-codes, built from a particular concatenation of two recursive systematic codes, linked together by nonuniform interleaving. Decoding calls on iterative processing in which each component decoder takes advantage of the work of the other at the previous step, with the aid of the original concept of extrinsic informat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998